Unique Shortest Vector Problem for max norm is NP-hard
نویسندگان
چکیده
The unique Shortest vector problem (uSVP) in lattice theory plays a crucial role in many public-key cryptosystems. The security of those cryptosystems bases on the hardness of uSVP. However, so far there is no proof for the proper hardness of uSVP even in its exact version. In this paper, we show that the exact version of uSVP for `∞ norm is NP-hard. Furthermore, many other lattice problems including unique Subspace avoiding problem, unique Closest vector problem and unique Generalized closest vector problem, for any `p norm, are also shown to be NP-hard.
منابع مشابه
Hardness of Lattice Problems in `p Norm
We show that for any integer p ≥ 46, the Shortest Vector Problem in `p norm is hard to approximate within factor (4/3)1−45.7/p. We also show a hardness factor of (3/2)1−111.7/p for p ≥ 112. As p grows, these factors approach 4/3 and 3/2 respectively. Both results hold under the assumption NP 6⊆ ZPP. We give a very simple reduction from known hardness results for Hypergraph Independent Set Probl...
متن کاملThe Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show the shortest vector problem in the l2 norm is NP-hard (for randomized reductions) to approximate within any constant factor less than p2. We also give a deterministic reduction under a reasonable number theoretic conjecture. Analogous results hold in any lp norm (p 1). In proving our NP-hardness result, we give an alternative construction satisfying Ajtai’s probabilistic variant of Saue...
متن کاملImproved hardness results for unique shortest vector problem
We give several improvements on the known hardness of the unique shortest vector problem in lattices, i.e., the problem of finding a shortest vector in a given lattice given a promise that the shortest vector is unique upto a uniqueness factor γ. We give a deterministic reduction from the shortest vector problem to the unique shortest vector problem. Before this, only a randomized reduction [20...
متن کاملOn the hardness of the shortest vector problem
An n-dimensional lattice is the set of all integral linear combinations of n linearly independent vectors in ' tm. One of the most studied algorithmic problems on lattices is the shortest vector problem (SVP): given a lattice, find the shortest non-zero vector in it. We prove that the shortest vector problem is NP-hard (for randomized reductions) to approximate within some constant factor great...
متن کاملThe Shortest Vector Problem in Lattices with Many Cycles
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Z/Λ. We give a proof that the shortest vector problem is NP-complete in the max-norm for n-dimensional lattices Λ where Z/Λ has n−1 cycles. We also give experimental data that show that the LLL algorithm does not perform significantly better on latti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008